Query-driven Data Completeness Management (PhD Thesis)
نویسنده
چکیده
Knowledge about data completeness is essentially in datasupported decision making. In this thesis we present a framework for metadata-based assessment of database completeness. We discuss how to express information about data completeness and how to use such information to draw conclusions about the completeness of query answers. In particular, we introduce formalisms for stating completeness for parts of relational databases. We then present techniques for drawing inferences between such statements and statements about the completeness of query answers, and show how the techniques can be extended to databases that contain null values. We show that the framework for relational databases can be transferred to RDF data, and that a similar framework can also be applied to spatial data. We also discuss how completeness information can be verified over processes, and introduce a data-aware process model that allows this verification. P U B L I C AT I O N O V E RV I E W conference publications • Simon Razniewski and Werner Nutt. Adding completeness information to query answers over spatial databases. International Conference on Advances in Geographic Information Systems (SIGSPATIAL), 2014. • Simon Razniewski, Marco Montali, and Werner Nutt. Verification of query completeness over processes. International Conference on Business Process Management (BPM), pages 155–170, 2013. Acceptance rate 14,4%. • Fariz Darari, Werner Nutt, Giuseppe Pirrò, and Simon Razniewski. Completeness statements about RDF data sources and their use for query answering. International Semantic Web Conference (ISWC), pages 66–83, 2013. Acceptance rate 21,5%. • Simon Razniewski and Werner Nutt. Assessing the completeness of geographical data (short paper). British National Conference on Databases (BNCOD), 2013. Acceptance rate 47,6%. • Werner Nutt and Simon Razniewski. Completeness of queries over SQL databases. Conference on Information and Knowledge Management (CIKM), pages 902–911, 2012. Acceptance rate 13,4%. • Simon Razniewski and Werner Nutt. Completeness of queries over incomplete databases. International Conference on Very Large Databases (VLDB), 2011. Acceptance rate 18,1%.
منابع مشابه
PhD Thesis Efficiently and Effectively Processing Probabilistic Queries on Uncertain Data Candidate
Uncertainty is inherent in many real applications. Uncertain data analysis and query processing has become a critical issue and has attracted a great deal of attention in database research community recently. The thesis, therefore, targets an important and challenging topic uncertain data management. It is a high quality and well-written PhD thesis. Five important and related aspects of uncerta...
متن کاملSystem P: Completeness-driven Query Answering in Peer Data Management Systems
Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers inter-connected with a network of schema mappings. Queries submitted at a peer are answered with local data and by data that is reached along paths of mappings. Due to redundancies in the mapping network, query answering in PD...
متن کاملQuery-driven Data Completeness Management
Incompleteness: Databases often do not contain all the information that they should, either because of delays in the data insertion process or because information is not entered at all Metadata: Ofent, information about which data is in a database exists or can be derived from business processes Quality information need: User want to know which queries over a database are reliable (comple...
متن کاملCompleteness-driven Query Answering in Peer Data Management Systems
Peer data management systems (Pdms) consist of a dynamic set of autonomous and heterogeneous peers connected with schema mappings. Queries submitted at a peer are answered with data residing at that peer and by recursively passing the query along the mappings to neighboring peers. Due to massive redundancy in mapping paths from the quering peer to any peer in the network, Pdms tend to be very i...
متن کاملFinding the Right Supervisor: Expert-Finding in a University Domain
Effective knowledge management is a key factor in the development and success of any organisation. Many different methods have been devised to address this need. Applying these methods to identify the experts within an organisation has attracted a lot of attention. We look at one such problem that arises within universities on a daily basis but has attracted little attention in the literature, ...
متن کامل